Pairs of trees in tree–tree triangulations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Triangulations without pointed spanning trees

Problem 50 in the Open Problems Project of the computational geometry community asks whether any triangulation on a point set in the plane contains a pointed spanning tree as a subgraph. We provide a counterexample. As a consequence we show that there exist triangulations which require a linear number of edge flips to become Hamiltonian.

متن کامل

Properties of Random Triangulations and Trees

Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural “geometric” features of a triangulation τ ∈ Tn, for example ∆n(τ) which counts the maximal number of diagonals in τ incident to a single vertex of K. It is familiar that Tn is bijectively equivalent to Bn, the set of rooted binary trees with n− 2 internal nodes, and also to P...

متن کامل

Transforming spanning trees and pseudo-triangulations

Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T ′ of TS are adjacent if T intersects T ′ only in points of S or in common edges. We prove that the diameter of TS is O(log k), where k denotes the number of convex layers of S. Based on this result, we show that the flip graph PS of pseudo-triangulations...

متن کامل

Trees and linear anticomplete pairs

We prove a conjecture of Liebenau, Pilipczuk, and the last two authors [8], that for every forest H there exists ε > 0, such that if G has n ≥ 2 vertices and does not contain H as an induced subgraph, then either • some vertex has degree at most εn; or • there are two disjoint sets A,B ⊆ V (G) with |A|, |B| ≥ εn, such that there are no edges between A,B. (It is known that no graphs H except for...

متن کامل

Quantitative Comparison of Tree Pairs Resulted from Gene and Protein Phylogenetic Trees for Sulfite Reductase Flavoprotein Alpha-Component and 5S rRNA and Taxonomic Trees in Selected Bacterial Species

Introduction: FAD is the cofactor of FAD-FR protein family. Sulfite reductase flavoprotein alpha-component is one of the main enzymes of this family. Based on applications of this enzyme in biotechnology and industry, it was chosen as the subject of evolutionary studies in 19 specific species. Method: Gene and protein sequences of sulfite reductase flavoprotein alpha-component, 5S rRNA sequence...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2007

ISSN: 0012-365X

DOI: 10.1016/j.disc.2005.11.087